Fast and Robust Stereo Matching Algorithms for Mining Automation
نویسندگان
چکیده
NOTICE: this is the author’s version of a work that was accepted for publication in Digital Signal Processing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Digital Signal Processing [VOL 9, ISSUE 3, 1999] DOI: http://dx.doi.org/10.1006/dspr.1999.0337
منابع مشابه
A parallel algorithm for incremental stereo matching on SIMD machines
Previous matching algorithms have achieved high speeds through algorithm simplification and/or relied on custom hardware. The objective of our work has been the development a robust high-speed stereo matcher by exploiting parallel algorithms executing on general purpose SIMD machines. Our approach is based on several existing techniques dealing with the classification and evaluation of matches,...
متن کاملFast window based stereo matching for 3D scene reconstruction
Stereo correspondence matching is a key problem in many applications like computer and robotic vision to determine Three-Dimensional (3D) depth information of objects which is essential for 3D reconstruction. This paper presents a 3D reconstruction technique with a fast stereo correspondence matching which is robust in tackling additive noise. The additive noise is eliminated using a fuzzy filt...
متن کاملHeterogeneous Computing for Real-Time Stereo Matching
Stereo matching is used in many computer vision applications such as 3D reconstruction, robot navigation, robotic surgery, 3-D video surveillance, and tracking object in 3D space. Real time stereo matching is difficult due to the heavy computation required for matching algorithms. In this paper a CPU/GPU heterogeneous computing platform is used to accelerate the processing and run the system in...
متن کاملFast and robust semi-local stereo matching using possibility distributions
Global stereo matching methods aim to reduce the sensibility of stereo correspondence to ambiguities caused by occlusions, poor local texture or fluctuation of illumination. However, when facing the problem of real-time stereo matching, as in robotic vision, local algorithms are known to be the best. In this paper, we propose a semi-local stereo matching algorithm (SLSM algorithm); an area-base...
متن کاملFast Census Transform-based Stereo Algorithm using SSE2
In this paper, we propose a census transform-based fast stereo algorithm. Most conventional fast stereo algorithms are based on SAD (Sum of Absolute Difference) or NC (Normalized Correlation). However, SAD is often sensitive to noise or illumination changes. Image matching by census transform is known to be robust to radiometric distortion, since the differences in gain and bias between two ima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Digital Signal Processing
دوره 9 شماره
صفحات -
تاریخ انتشار 1999